Column-Based Graph Layouts
نویسندگان
چکیده
منابع مشابه
Column-Based Graph Layouts
We consider orthogonal upward drawings of directed acyclic graphs with nodes of uniform width but node-specific height. One way to draw such graphs is to use a layering technique as provided by the Sugiyama framework [34]. To overcome one of the drawbacks of the Sugiyama Framework, namely, unnecessary edge crossings caused by an unfortunate layer assignment of the nodes, Chimani et al. integrat...
متن کاملLayouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. A k-track layout of a graph consists of a vertex k-colouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The sta...
متن کاملScaling Up Radial Graph Layouts
The well-known radial graph layout technique has plenty of advantages for graph visualization and graph exploration, but is quite limited in the size of graphs it can display effectively because the layout is inherently global and allows far away or out of view nodes to distort the focus region. The primary contribution of this project is to introduce sub tree clustering to allow the layout alg...
متن کاملGraph layouts via layered separators
A k-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets such that no two edges that are in the same set are nested with respect to the vertex ordering. A k-track layout of a graph consists of a vertex kcolouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The queue-numbe...
متن کاملGraph Layouts by t-SNE
We propose a new graph layout method based on a modification of the t-distributed Stochastic Neighbor Embedding (t-SNE) dimensionality reduction technique. Although t-SNE is one of the best techniques for visualizing high-dimensional data as 2D scatterplots, t-SNE has not been used in the context of classical graph layout. We propose a new graph layout method, tsNET, based on representing a gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2014
ISSN: 1526-1719
DOI: 10.7155/jgaa.00341